Ultra-fast hadronic calorimetry
نویسندگان
چکیده
منابع مشابه
Determination of volatility of ionic liquids at the nanoscale by means of ultra-fast scanning calorimetry.
The determination of vaporization enthalpies of extremely low volatility ionic liquids is challenging and time consuming due to the low values of vapor pressure. In addition, these liquids tend to decompose even at temperatures where the vapor pressure is still low. Conventional methods for determination of vaporization enthalpies are thus limited to temperatures below the decomposition tempera...
متن کاملHadronic Shower Development in Tile Iron-scintillator Calorimetry
The lateral and longitudinal profiles of hadronic showers detected by a prototype of the ATLAS Iron-Scintillator Tile Hadron Calorimeter have been investigated. This calorimeter uses a unique longitudinal configuration of scintillator tiles. Using a fine-grained pion beam scan at 100 GeV, a detailed picture of transverse shower behavior is obtained. The underlying radial energy densities for fo...
متن کاملUltra-peripheral collisions and hadronic structure
Ultra-peripheral collisions are the energy frontier for photon-mediated interactions, reaching, at the Large Hadron Collider (LHC), γ− p center of mass energies five to ten times higher than at HERA and reaching γγ energies higher than at LEP. Photoproduction of heavy quarkonium and dijets in pp and pA collisions probes the gluon distribution in protons at Bjorken-x values down to 3 × 10−6, far...
متن کاملUltra-Fast Image Reconstruction of Tomosynthesis Mammography Using GPU
Digital Breast Tomosynthesis (DBT) is a technology that creates three dimensional (3D) images of breast tissue. Tomosynthesis mammography detects lesions that are not detectable with other imaging systems. If image reconstruction time is in the order of seconds, we can use Tomosynthesis systems to perform Tomosynthesis-guided Interventional procedures. This research has been designed to study u...
متن کاملUltra - Fast Expected TimeParallel
It has been shown previously that sorting n items into n locations with a polynomial number of processors requires (log n= log log n) time. We sidestep this lower bound with the idea of Padded Sorting, or sorting n items into n+o(n) locations. Since many problems do not rely on the exact rank of sorted items, a Padded Sort is often just as useful as an unpadded sort. Our algorithm for Padded So...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
سال: 2018
ISSN: 0168-9002
DOI: 10.1016/j.nima.2018.05.003